例句與造句

1. The incremental algorithm use a tree structure to organize the set of concept nodes , and decrease the time needed to build concept lattice
   本文的漸進式算法利用一種樹狀結構來對概念格節(jié)點進行索引，從而有效地提高了概念格的構造速度。
2. In lacs , considering the characteristics of classification , we suggest two pruning strategies to confine the generation of concept nodes in the procedure of building concept lattice so that the number of nodes generated decreases greatly
   在lacs系統(tǒng)中，針對分類系統(tǒng)的特點，我們提出兩合肥工業(yè)大學博士學位論文種重要而有效地剪枝策略來限制格構造過程中的節(jié)點生成，從而大大減少了所需生成的格節(jié)點數(shù)目
3. 2 ) based on the invariability ( or approximate invariability ) of function value , we give out the definitions of intent reduct ( or approximate intent reduct ) and intent core ( or approximate intent core ) of concept node , investigate their properties in detail , and prove that the problems of computing them can be transformed into the problem of computing the minimal cover of a family of sets
   2 ）在函數(shù)取值不變性（或近似不變性）的基礎上，提出了概念節(jié)點的內(nèi)涵縮減（或近似內(nèi)涵縮減）和內(nèi)涵核（或近似內(nèi)涵核）的概念，詳細地研究了它們的性質，證明了它們的計算問題都可以等價地轉化為族集最小覆蓋集的計算問題。
4. 3 ) to discover association rules , we present a framework based on concept lattice . first , in the light of the requirement of mining association rules , the structure of concept node is simplified , and the corresponding building algorithm is developed . then we give out the algorithms for extracting association rules from the lattice based on intent reduct , where two properties are exploited to remove the redundant rules
   首先，針對關聯(lián)規(guī)則發(fā)現(xiàn)的需求，我們對概念格節(jié)點的結構進行了相應的簡化修改，并給出了相應的構造算法；然后基于內(nèi)涵縮減，我們給出了從格上提取關聯(lián)規(guī)則的算法偽碼，兩個性質被用來去除冗余的關聯(lián)規(guī)則；文中還分析了基于概念格的關聯(lián)規(guī)則發(fā)現(xiàn)與傳統(tǒng)的發(fā)現(xiàn)算法相比所具有一系列的優(yōu)點。
5. It's difficult to find concept node in a sentence. 用concept node造句挺難的